

public class Queue<T> {
    private Node head;
    private Node last;
    private int N;
    private class Node{
        public T item;
        public Node next;
        public Node(T item,Node next){
            this.item =item;
            this.next = next;
        }
    }
    public Queue(){
        this.head =new Node(null,null);

    }
    public boolean isEmpty(){
        return false;
    }
    public int size(){
        return 1;
    }
    public void enqueue(T t){

    }
}
